Approximation Schemes for Partitioning: Convex Decomposition and Surface Approximation
نویسندگان
چکیده
We revisit two NP-hard geometric partitioning problems – convex decomposition and surface approximation. Building on recent developments in geometric separators, we present quasi-polynomial time algorithms for these problems with improved approximation guarantees. ∗[email protected] †[email protected] ‡[email protected] 1 ar X iv :1 40 4. 37 76 v1 [ cs .C G ] 1 4 A pr 2 01 4
منابع مشابه
Biorthogonal wavelet-based full-approximation schemes for the numerical solution of elasto-hydrodynamic lubrication problems
Biorthogonal wavelet-based full-approximation schemes are introduced in this paper for the numerical solution of elasto-hydrodynamic lubrication line and point contact problems. The proposed methods give higher accuracy in terms of better convergence with low computational time, which have been demonstrated through the illustrative problems.
متن کاملAPPROXIMATION OF STOCHASTIC PARABOLIC DIFFERENTIAL EQUATIONS WITH TWO DIFFERENT FINITE DIFFERENCE SCHEMES
We focus on the use of two stable and accurate explicit finite difference schemes in order to approximate the solution of stochastic partial differential equations of It¨o type, in particular, parabolic equations. The main properties of these deterministic difference methods, i.e., convergence, consistency, and stability, are separately developed for the stochastic cases.
متن کاملADOMIAN DECOMPOSITION METHOD AND PADÉ APPROXIMATION TO DETERMINE FIN EFFICIENCY OF CONVECTIVE SOLAR AIR COLLECTOR IN STRAIGHT FINS
In this paper, the nonlinear differential equation for the convection of the temperature distribution of a straight fin with the thermal conductivity depends on the temperature is solved using Adomian Decomposition Method and Padé approximation(PADM) for boundary problems. Actual results are then compared with results obtained previously using digital solution by Runge–Kuttamethod and a diffe...
متن کاملSIZE AND GEOMETRY OPTIMIZATION OF TRUSS STRUCTURES USING THE COMBINATION OF DNA COMPUTING ALGORITHM AND GENERALIZED CONVEX APPROXIMATION METHOD
In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...
متن کاملA HYBRID ALGORITHM FOR SIZING AND LAYOUT OPTIMIZATION OF TRUSS STRUCTURES COMBINING DISCRETE PSO AND CONVEX APPROXIMATION
An efficient method for size and layout optimization of the truss structures is presented in this paper. In order to this, an efficient method by combining an improved discrete particle swarm optimization (IDPSO) and method of moving asymptotes (MMA) is proposed. In the hybrid of IDPSO and MMA, the nodal coordinates defining the layout of the structure are optimized with MMA, and afterwards the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015